Parameterized Counting Problems
نویسنده
چکیده
Parameterized complexity has so far been largely con ned to consideration of computational problems as decision or search prob lems However it is becoming evident that the parameterized point of view can lead to new insight into counting problems The goal of this article is to introduce a formal framework in which one may consider parameterized counting problems
منابع مشابه
The Parameterized Complexity of Counting Problems
We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of parameterized counting complexity classes #W[t], for t ≥ 1, that corresponds to Downey and Fellows’s W-hierarchy [13] and show that a few central W-completeness results for decision problems translate to #W-completeness results for the corresponding counting problems. Cou...
متن کاملOn the parameterized complexity of approximate counting
In this paper we study the parameterized complexity of approximating the parameterized counting problems contained in the class #W [P ] ; the parameterized analogue of #P: We prove a parameterized analogue of a famous theorem of Stockmeyer claiming that approximate counting belongs to the second level of the polynomial hierarchy.
متن کاملKernelizations for Parameterized Counting Problems
Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems, to wit, counting kernelizations which turn out to be equivalent to the fixed parameter tractability of counting problems. Furthermore, we study the application of well-known kernelization techniques to counting problems. Among ...
متن کاملApproximate Counting via Correlation Decay on Planar Graphs
We show for a broad class of counting problems, correlation decay (strong spatial mixing) implies FPTAS on planar graphs. The framework for the counting problems considered by us is the Holant problems with arbitrary constant-size domain and symmetric constraint functions. We define a notion of regularity on the constraint functions, which covers a wide range of natural and important counting p...
متن کاملContributions to Parameterized Complexity
This thesis is presented in two parts. In Part One we concentrate on algorithmic aspects of parameterized complexity. We explore ways in which the concepts and algorithmic techniques of parameterized complexity can be fruitfully brought to bear on a (classically) well-studied problem area, that of scheduling problems modelled on partial orderings. We develop efficient and constructive algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002